Complexity and decidability for chain code picture languages
نویسندگان
چکیده
منابع مشابه
Chapter 2 Languages , Decidability , and Complexity
Control problems for discrete-event systems or hybrid systems typically involve manipulation of languages that describe system behaviors. This chapter introduces basic automata and grammar models for generating and analyzing languages of the Chomsky hierarchy, as well as their associated decision problems, which are necessary for the understanding of other parts of this book. Notions of decidab...
متن کاملOn the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems
Chain Code Picture Systems are Lindenmayer systems over a special alphabet. The strings generated are interpreted as pictures. This leads to Chain Code Picture Languages. In this paper, synchronous deterministic Chain Code Picture Systems (sD0L systems) are studied with respect to the finiteness of their picture languages. First, a hierarchy of abstractions is developed, in which the interpreta...
متن کاملFormal Descriptions of Code Properties: Decidability, Complexity, Implementation
The branch of coding theory that is based on formal languages has produced several methods for defining code properties, including word relations, dependence systems, implicational conditions, trajectories, and language inequations. Of those, the latter three can be viewed as formal methods in the sense that a certain formal expression can be used to denote a code property. Here we present a fo...
متن کاملComplexity, decidability and completeness
We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory ha...
متن کاملOn the Complexity of Unary Tiling-Recognizable Picture Languages
We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary strings to represent unary pictures and we prove that any unary picture language L is in Rec1 if and only if the set of all quasi-unary strings encoding the elements of L is recognizable by a one-tape nondeterministic Turing m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90041-6